Pareto Optimality for Multioptimization of Continuous Linear Operators

نویسندگان

چکیده

This manuscript determines the set of Pareto optimal solutions certain multiobjective-optimization problems involving continuous linear operators defined on Banach spaces and Hilbert spaces. These multioptimization typically arise in engineering. In order to accomplish our goals, we first characterize, an abstract setting, any multiobjective optimization problem. We then provide sufficient topological conditions ensure existence solutions. Next, determine convex max–min prove that a form max∥T(x)∥, min∥x∥ coincides with multiples supporting vectors T. Lastly, apply this result space which also applies design truly coils

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pareto-optimality of Compromise Decisions Pareto-optimality of Compromise Decisions

This paper deals with the problem of existence of compromise decisions and conditions for a compromise decision to be weakly Pareto-optimal, i.e., to be a weak Pareto-maximizer, Pareto-maximizer, or strong Pareto-maximizer. The concept of compromise decision is generalized by adopting triangular norms. Further, a concept of fuzzy interval is introduced. Suucient conditions for the existence of ...

متن کامل

Generalized Continuous Frames for Operators

In this note, the notion of generalized continuous K- frame in a Hilbert space is defined. Examples have been given to exhibit the existence of generalized continuous $K$-frames. A necessary and sufficient condition for the existence of a generalized continuous $K$-frame in terms of its frame operator is obtained and a characterization of a generalized continuous $K$-frame for $ mathcal{H} $ wi...

متن کامل

Pareto Optimality in Coevolutionary Learning

We develop a novel coevolutionary algorithm based upon the concept of Pareto optimality. The Pareto criterion is core to conventional multi-objective optimization (MOO) algorithms. We can think of agents in a coevolutionary system as performing MOO, as well: An agent interacts with many other agents, each of which can be regarded as an objective for optimization. We adapt the Pareto concept to ...

متن کامل

Pareto Optimality in Abstract Argumentation

Since its introduction in the mid-nineties, Dung’s theory of abstract argumentation frameworks has been influential in artificial intelligence. Dung viewed arguments as abstract entities with a binary defeat relation among them. This enabled extensive analysis of different (semantic) argument acceptance criteria. However, little attention was given to comparing such criteria in relation to the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Symmetry

سال: 2021

ISSN: ['0865-4824', '2226-1877']

DOI: https://doi.org/10.3390/sym13040661